Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives

Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are both desirable and undesirable at the same time, e.g., an airport. This can be modeled as a multicriteria network location problem, where some of the sum-objectives are maximized (push effect) and some of the sum-objectives are minimized (pull effect).We present a polynomial time algorithm for this model along with some basic theoretical results, and generalize the results also to incorporate maximin and minimax objectives. In fact, the method works for any piecewise linear objective functions. Finally, we present some computational results.     

Nonlinear Filtering for Diffusions in Random Environments

Suppose that the signal X to be estimated is a diffusion process in a random medium W and the signal is correlated with the observation noise. We study the historical filtering problem concerned with estimating the signal path up until the current time based upon the back observations. Using Dirichlet form theory, we introduce a filtering model for general rough signal X ^W and establish a multiple Wiener integrals representation for the unnormalized pathspace filtering process. Then, we construct a precise nonlinear filtering model for the process X itself and give the corresponding Wiener chaos decomposition.     

Transient free‐surface flow of a viscoelastic fluid in a narrow channel

The interplay between inertia and elasticity is examined for transient free‐surface flow inside a narrow channel. The lubrication theory is extended for the flow of viscoelastic fluids of the Oldroyd‐B type (consisting of a Newtonian solvent and a polymeric solute). While the general formulation accounts for non‐linearities stemming from inertia effects in the momentum conservation equation, and the upper‐convected terms in the constitutive equation, only the front movement contributes to non‐linear coupling for a flow inside a straight channel. In this case, it is possible to implement a spectral representation in the depthwise direction for the velocity and stress. The evolution of the flow field is obtained locally, but the front movement is captured only in the mean sense. The influence of inertia, elasticity and viscosity ratio is examined for pressure‐induced flow. The front appears to progress monotonically with time. However, the velocity and stress exhibit typically a strong overshoot upon inception, accompanied by a plug‐flow behaviour in the channel core. The flow intensity eventually diminishes with time, tending asymptotically to Poiseuille conditions. For highly elastic liquids the front movement becomes oscillatory, experiencing strong deceleration periodically. A multiple‐scale solution is obtained for fluids with no inertia and small elasticity. Comparison with the exact (numerical) solution indicates a wide range of validity for the analytical result. Copyright © 2004 John Wiley & Sons, Ltd.     

Discretization and resolution of the (<Emphasis Type="Italic">r</Emphasis>|<Emphasis Type="Italic">X</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>)-medianoid problem involving quality criteria

In this paper an extension of the (r|X _p )-medianoid on networks introduced by Hakimi (1983) is studied. In this extension the customer considers not only the distance but some characteristics of the facilities such as store size, quality of service and parking space. A new firm wants to establishr new facilities which have to compete with thep facilities that already exist in the market. The entry firm wants to find their locations and characteristics to maximize profits. Three different customer choice rules (binary, partially binary and proportional preferences) are considered. Some discretization results are obtained and a resolution procedure is proposed. The problem is solved combining a global search algorithm based on a branch and bound procedure with some combinatorial heuristics (greedy, interchange, and tabu search). Some computational experiences are presented. Partially supported by Ministerio de Ciencia y Tecnología (Spain) and FEDER, grant BFM2002-04525-C02-01.     

多指标区间决策的理想点贴近法

研究了指标的权重不能完全确定但知道其所在区域的条件下的多指标决策问题 ,给出了方案与理想解的贴近度及其算法 ,按贴近度的大小可以对方案进行排序 .它同传统的决策方法相比较 ,具有需要信息量少 ,简单可靠等特点 .最后用该决策方法分析了一个实际问题 .     

A Generalized Markov Sampler

A recent development of the Markov chain Monte Carlo (MCMC) technique is the emergence of MCMC samplers that allow transitions between different models. Such samplers make possible a range of computational tasks involving models, including model selection, model evaluation, model averaging and hypothesis testing. An example of this type of sampler is the reversible jump MCMC sampler, which is a generalization of the Metropolis–Hastings algorithm. Here, we present a new MCMC sampler of this type. The new sampler is a generalization of the Gibbs sampler, but somewhat surprisingly, it also turns out to encompass as particular cases all of the well-known MCMC samplers, including those of Metropolis, Barker, and Hastings. Moreover, the new sampler generalizes the reversible jump MCMC. It therefore appears to be a very general framework for MCMC sampling. This paper describes the new sampler and illustrates its use in three applications in Computational Biology, specifically determination of consensus sequences, phylogenetic inference and delineation of isochores via multiple change-point analysis.     

多重向量值正交小波包

本文引入多重向量值小波包的概念,提供一类多重向量值正交小波包的构造方法,并运用积分变换和算子理论,讨论了多重向量值正交小波包的性质．利用多重向量值正交小波包,构造了空间L2(R,Cs×s)的新的正交基．     

指数型寿命数据中异常值的检验

本文讨论了在指数型寿命数据中,对同时存在的异常大数据和异常小数据的检验方法,给出了一个明确的判别标准,并以一例说明其应用。     

The location of median paths on grid graphs

In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located. The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous spaces and network facility location. We will show that the problems presented here have a close connection with continuous dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional facilities location in the continuous case.     

测定透镜厚度新法及其误差探讨

本文介绍利用景深短、高倍率、大口径的物镜，采用光学方法，对被测透镜上下表面调焦，从而测定其中心厚度的一种新方法，并对测量误差进行了探讨。